Fast approximate subspace tracking (FAST)
نویسندگان
چکیده
A new fast and accurate algorithm for tracking singular values, singular vectors and the dimension of the signal subspace through an overlapping sequence of data matrices is presented. The accuracy of the algorithm approaches that of the Prony-Lanczos (PL) method [1] with speed and accuracy superior to both the PAST and PASTd algorithms [2] for moderate to large size problems. The algorithm is described for the special case of changes to two columns of the matrix prior to each update of principal singular vectors and values. Comparisons of speed and accuracy are made with the algorithms named above.
منابع مشابه
A fast algorithm for subspace tracking
Fast estimation and tracking of the principal subspace of a sequence of random vectors is a classic problem, widely encountered in areas such as radar, sonar and speech processing, data compression, data filtering, parameter estimation, pattern recognition, neural analysis, wireless communications, to name just a few. Among the most robust algorithms for subspace tracking there are the so calle...
متن کاملA Fast Signal Subspace Tracking Algorithm Based on a Subspace Information Criterion
In this paper, we present a new algorithm for tracking the signal subspace recursively. It is based on a new interpretation of the signal subspace. We introduce a novel information criterion for signal subspace estimation. We show that the solution of the proposed constrained optimization problem results the signal subspace. In addition, we introduce three adaptive algorithms which can be used ...
متن کاملFast Time-varying modal parameter identification algorithm based on two-layer linear neural network learning for subspace tracking
* This work is supported by NSF Grant #10672045 to Yu Kaiping Abstract—The key of fast identification algorithm of time-varying modal parameter based on subspace tracking is to find efficient and fast subspace-tracking algorithm. This paper presents a modified version of NIC(Novel Information Criterion) adopted in two-layer linear neural network learning for subspace tracking, which is applied ...
متن کاملAdaptive ESPRIT algorithm based on the PAST subspace tracker
The Estimation of Signal Parameters via Rotational Invariance Techniques (ESPRIT) algorithm is a subspace-based analysis method used in source localization or frequency estimation, originally designed in a block signal processing context. In other respects, the Projection Approximation Subspace Tracker (PAST) is a fast and robust subspace tracking method. This paper introduces a new frequency e...
متن کاملFast, accurate subspace tracking using operator restriction analysis
A new noniterative subspace tracking method is presented. This method is called the operator restriction algorithm (OPERA) and it can be used whenever an update to the principal components of an EVD or SVD of a rank-one update of a given matrix is needed. The updating algorithms are based on the technique of restricting a linear operator to a subspace and the concept of an invariant subspace an...
متن کامل